Some properties of fuzzy reasoning in propositional fuzzy logic systems

نویسندگان

  • Jiancheng Zhang
  • Xiyang Yang
چکیده

In order to analyze the logical foundation of fuzzy reasoning, this paper first introduces the concept of generalized roots of theories in Łukasiewicz propositional fuzzy logic Łuk, Gödel propositional fuzzy logic Göd, Product propositional fuzzy logic P, and nilpotent minimum logic NM (the R0-propositional fuzzy logic L ). Next, it is proved that all consequences of a theory C, named D(C), are completely determined by its generalized root whenever C has a generalized root. Moreover, it is proved that every finite theory C has a generalized root, which can be expressed by a specific formula. Finally, we demonstrate the existence of a non-fuzzy version of Fuzzy Modus Ponens (FMP) in Łuk, Göd, P and NM ðL Þ, and we provide its numerical version as a new algorithm for solving FMP. 2010 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Fuzzy Propositional Formulas under the Stable Model Semantics

We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax of fuzzy propositional logic, but its semantics distinguishes stable models from non-stable models. The generality of the language allows for highly configura...

متن کامل

Reasoning with propositional knowledge based on fuzzy neural logic

Reasoning with propositional knowledge based on fuzzy neural logic" (1996). In this article, a new kind of reasoning for propositional knowledge, which is based on the fuzzy neural logic initialed by Teh, is introduced. A fundamental theorem is presented showing that any fuzzy neural logic network can be represented by operations: bounded sum, complement, and scalar product. Propositional calcu...

متن کامل

Further Study of the Fuzzy Reasoning Based on Propositional Modal Logic

The notion of the fuzzy assertion based on propositional modal logic is introduced and the properties of the fuzzy reasoning based on fuzzy assertions are studied. As an extending of the traditional semantics of modal logics, the fuzzy Kripke semantics is considered and a formal fuzzy reasoning system based on fuzzy constraint is established. In order to decide whether a fuzzy assertion is a lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 180  شماره 

صفحات  -

تاریخ انتشار 2010